import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class Woodstock implements Runnable {
    private void solve() {
  		int n = nextInt();
		long[] s = new long[n + 1];
		for (int i = 0; i < (n + 1); i++) {
			for (int j = 0; j < (2 * n + 1); j++) {
				int p = Math.max(i, Math.abs(j - n));
				s[p] += nextInt();
			}
		}
		int z = 0;
		for (int i = 0; i <= n; i++) {
			if (s[i] > s[z]) z = i;
		}
	 	writer.println(z + " " + s[z]);
    }

    public static void main(String[] args) {
        new Woodstock().run();
    }

    BufferedReader reader;
    StringTokenizer tokenizer;
    PrintWriter writer;

    static final String TASK_ID = "woodstock";

    public void run() {
        try {
            reader = new BufferedReader(new FileReader(TASK_ID + ".in"));
            tokenizer = null;
            writer = new PrintWriter(TASK_ID + ".out");
            solve();
            reader.close();
            writer.close();
        } catch (Exception e) {
            throw new RuntimeException(e);
        }
    }

    int nextInt() {
        return Integer.parseInt(nextToken());
    }

    long nextLong() {
        return Long.parseLong(nextToken());
    }

    double nextDouble() {
        return Double.parseDouble(nextToken());
    }

    String nextToken() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }
}
